queuing algorithmの例文

• Several general-purpose priority queue algorithms have proven effective for discrete-event simulation, most notably, the splay tree.
• The byte-weighted fair queuing algorithm aims to mimic a bit-per-bit multiplexing by computing theoretical departure date for each packet.
• A byte-weighted version was proposed by A . Demers, S . Keshav and S . Shenker in 1989, and was based on the earlier Nagle fair queuing algorithm.